Sliding-Window Superposition Coding: Two-User Interference Channels
نویسندگان
چکیده
منابع مشابه
Sliding-Window Superposition Coding: Two-User Interference Channels
A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed coding scheme uses superposition of multiple codewords with successive cancellation decoding, which can be implemented using standard point-to-point encoder...
متن کاملThe Expected Achievable Distortion of Two-User Decentralized Interference Channels
This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...
متن کاملA General Coding Scheme for Two-User Fading Interference Channels
A Han-Kobayashi based achievable scheme is presented for ergodic fading two-user Gaussian interference channels (IFCs) with perfect channel state information at all nodes and Gaussian codebooks with no time-sharing. Using max-min optimization techniques, it is shown that jointly coding across all states performs at least as well as separable coding for the sub-classes of uniformly weak (every s...
متن کاملthe expected achievable distortion of two-user decentralized interference channels
this paper concerns the transmission of two independent gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous csis. the availability of the channel state information at receivers (csir) is considered in two scenarios of perfect and imperfect csir. in the imperfect csir case, we consider a more practical assumption of...
متن کاملSuperposition Coding for Costa Channels
We present practical codes designed for the Gaussian dirty paper (Costa) channel. We show that the dirty paper decoding problem can be transformed into an equivalent multiple-access problem, for which we apply superposition coding. Our approach is a generalization of the nested lattices approach of Zamir, Shamai and Erez. We present simulation results which confirm the effectiveness of our meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2975162